The number of subsets of integers with no k-term arithmetic progression

نویسندگان

  • József Balogh
  • Hong Liu
  • Maryam Sharifzadeh
چکیده

Addressing a question of Cameron and Erdős, we show that, for infinitely many values of n, the number of subsets of {1, 2, . . . , n} that do not contain a k-term arithmetic progression is at most 2O(rk(n)), where rk(n) is the maximum cardinality of a subset of {1, 2, . . . , n} without a k-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of n, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on rk(n) to the sparse random setting. To achieve these bounds, we establish a new supersaturation result, which roughly states that sets of size Θ(rk(n)) contain superlinearly many k-term arithmetic progressions. For integers r and k, Erdős asked whether there is a set of integers S with no (k+1)term arithmetic progression, but such that any r-coloring of S yields a monochromatic k-term arithmetic progression. Nešetřil and Rödl, and independently Spencer, answered this question affirmatively. We show the following density version: for every k ≥ 3 and δ > 0, there exists a reasonably dense subset of primes S with no (k+1)-term arithmetic progression, yet every U ⊆ S of size |U | ≥ δ|S| contains a k-term arithmetic progression. Our proof uses the hypergraph container method, which has proven to be a very powerful tool in extremal combinatorics. The idea behind the container method is to have a small certificate set to describe a large independent set. We give two further applications in the appendix using this idea. ∗Department of Mathematical Sciences, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, USA. Email: [email protected]. Research is partially supported by NSA Grant H98230-15-10002, NSF DMS-1500121 and Arnold O. Beckman Research Award (UIUC Campus Research Board 15006). †Mathematics Institute and DIMAP, University of Warwick, Coventry, CV4 7AL, UK. Email: [email protected]. This research was done while HL was at University of Illinois at UrbanaChampaign. ‡Department of Mathematical Sciences, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, USA. Email: [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On rainbow 4-term arithmetic progressions

{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...

متن کامل

On sequences of positive integers containing no p terms in arithmetic progression

We use topological ideas to show that, assuming the conjecture of Erdös [4] on subsets of positive integers having no p terms in arithmetic progression (A. P.), there must exist a subset Mp of positive integers with no p terms in A. P. with the property that among all such subsets, Mp maximizes the sum of the reciprocals of its elements.

متن کامل

Integer Sets Containing No Arithmetic Progressions

lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of length k. This is the famous theorem of van der Waerden [10], dating from 1927. The proof of this uses multiple nested inductions, which result in extremely weak bounds for N{h,k). We shall define Bk to...

متن کامل

The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit

How few three-term arithmetic progressions can a subset S ⊆ ZN := Z/NZ have if |S| ≥ υN? (that is, S has density at least υ). Varnavides [4] showed that this number of arithmetic-progressions is at least c(υ)N for sufficiently large integers N ; and, it is well-known that determining good lower bounds for c(υ) > 0 is at the same level of depth as Erdös’s famous conjecture about whether a subset...

متن کامل

Variations on van der Waerden’s and Ramsey’s Theorems

Most published proofs of van der Waerden’s theorem are carried out by induction on k and l. It wuld be of interest to find a direct inductive proof of Theorem V’. In this note, however, we shall show that Theorem V implies Theorem V’ and conversely. To this end, it is convenient to let V (k; l) denote the statement that if the set N of all positive integers is partitioned into k subsets, then a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016